Generalized Graph Colorability and Compressibility of Boolean Formulae

نویسندگان

  • Richard Nock
  • Pascal Jappy
  • Jean Sallantin
چکیده

In this paper, we study the possibility of Occam’s razors for a widely studied class of Boolean Formulae : Disjunctive Normal Forms (DNF). An Occam’s razor is an algorithm which compresses the knowledge of observations (examples) in small formulae. We prove that approximating the minimally consistent DNF formula, and a generalization of graph colorability, is very hard. Our proof technique is such that the stronger the complexity hypothesis used, the larger the inapproximability ratio obtained. Our ratio is among the first to integrate the three parameters of Occam’s razors : the number of examples, the number of description attributes and the size of the target formula labelling the examples. Theoretically speaking, our result rules out the existence of efficient deterministic Occam’s razor algorithms for DNF. Practically speaking, it puts a large worst-case lower bound on the formulae’s sizes found by learning systems proceeding by rule searching.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Degree Distance of Strong Product of Graphs

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...

متن کامل

G-free Colorability and the Boolean Prime Ideal Theorem

We show that the compactness of G-free k-colorability is equivalent to the Boolean prime ideal theorem for any graph G with more than two vertices and any k ≥ 2.

متن کامل

Exact Complexity of Exact-Four-Colorability

Let Mk ⊆ N be a given set that consists of k noncontiguous integers. Define Exact-Mk-Colorability to be the problem of determining whether χ(G), the chromatic number of a given graph G, equals one of the k elements of the set Mk exactly. In 1987, Wagner [Wag87] proved that Exact-Mk-Colorability is BH2k(NP)-complete, where Mk = {6k + 1, 6k + 3, . . . , 8k − 1} and BH2k(NP) is the 2kth level of t...

متن کامل

Graph Structures in DNA

We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or k = 4) branched junction molecules are used to form the graph. We present the solution to the 3-SAT problem and to the 3-vertex-colorability problem. Construction of one graph structure (in many copies) in both procedures is suucie...

متن کامل

Three Dimensional DNA Structures in

We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or k = 4) branched junction molecules are used to form graphs. We present procedures for the 3-SAT and 3-vertex-colorability problems. Construction of one graph structure (in many copies) is suucient to determine the solution to the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998